Memory Models for Improving Probabilistic Tabu Search for Continuous Real Variables
نویسنده
چکیده
This paper proposes that current memory models in us for tabu search algorithms are at best evolving, as opposed to adaptive, and that significant improvement can be made by considering the structure of human memory. By introducing a new memory structure, intended to reduce the number of evaluations required at each step, it is possible to allow the search method to learn about the solution space in which it is operating. The memory model is based on the transfer of events from episodic memory into generalised rules stored in semantic memory. By adopting such a model, the search algorithm can intelligently explore the solution space in response to what has been learned to date and update the stored knowledge as the search progresses. This implements a truly adaptive memory for the method.
منابع مشابه
A GUIDED TABU SEARCH FOR PROFILE OPTIMIZATION OF FINITE ELEMENT MODELS
In this paper a Guided Tabu Search (GTS) is utilized for optimal nodal ordering of finite element models (FEMs) leading to small profile for the stiffness matrices of the models. The search strategy is accelerated and a graph-theoretical approach is used as guidance. The method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. Comp...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملScheduling ambulance crews for maximum coverage
This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for thi...
متن کاملTabu search and finite convergence
We establish finite convergence for some tabu search algorithms based on recency memory or frequency memory, distinguishing between symmetric and asymmetric neighborhood structures. These are the first demonstrations of explicit bounds provided by such forms of memory, and their finiteness suggests an important distinction between these ideas and those underlying certain "probabilistic" procedu...
متن کاملTabu Search for Mixed Integer Programming
This paper introduces tabu search for the solution of general linear integer problems. Search is done on integer variables; if there are continuous variables, their corresponding value is determined through the solution of a linear program, which is also used to evaluate the integer solution. The complete tabu search procedure includes an intensification and diversification procedure, whose eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005